On Theorem Proving in Annotated
نویسندگان
چکیده
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملDeduction and Search Strategies for Regular Multiple-Valued Logics
The inference rule !-resolution was introduced in [27] as a technique for developing an SLD-style query answering procedure for the logic programming subset of annotated logic. The inference rule requires that the lattice of truth values be ordinary. In this paper, it is proved that all complete distributive lattices are ordinary. Properties of !-resolution in the general theorem proving settin...
متن کاملOn theorem proving in annotated logics
Annotated logics are a class of paraconsistent logics[?] that have been used to provide the semantical foundations of various reasoning systems which may contain useful inconsistent or imprecise information. They were initially proposed by Subrahmanian based on a specific set, viz. [0, 1] ∪ {>}, of truth values[?], and subsequently studied from the viewpoints of foundation and logic programming...
متن کاملA fixed point method for proving the stability of ring $(alpha, beta, gamma)$-derivations in $2$-Banach algebras
In this paper, we first present the new concept of $2$-normed algebra. We investigate the structure of this algebra and give some examples. Then we apply a fixed point theorem to prove the stability and hyperstability of $(alpha, beta, gamma)$-derivations in $2$-Banach algebras.
متن کاملUsing Rippling for Equational Reasoning
This paper presents techniques to guide equational reasoning in a goal directed way. Suggested by rippling methods developed in the eld of inductive theorem proving we use annotated terms to represent syntactical diierences of formulas. Based on these annotations and on hierarchies of function symbols we deene diierent abstractions of formulas which are used for planning of proofs. Rippling tec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007